Affine Pairings on ARM
نویسندگان
چکیده
We report on relative performance numbers for affine and projective pairings on a dual-core Cortex A9 ARM processor. Using a fast inversion in the base field and doing inversion in extension fields by using the norm map to reduce to inversions in smaller fields, we find a very low ratio of inversion-to-multiplication costs. In our implementation, this favors using affine coordinates, even for the current 128-bit minimum security level specified by NIST. We use Barreto-Naehrig (BN) curves and report on the performance of an optimal ate pairing for curves covering security levels between 128 and 192 bits. We compare with other reported performance numbers for pairing computation on ARM CPUs.
منابع مشابه
An Analysis of Affine Coordinates for Pairing Computation
In this paper we analyze the use of affine coordinates for pairing computation. We observe that in many practical settings, e. g. when implementing optimal ate pairings in high security levels, affine coordinates are faster than using the best currently known formulas for projective coordinates. This observation relies on two known techniques for speeding up field inversions which we analyze in...
متن کاملEfficient Implementation of Bilinear Pairings on ARM Processors
As hardware capabilities increase, low-power devices such as smartphones represent a natural environment for the efficient implementation of cryptographic pairings. Few works in the literature have considered such platforms despite their growing importance in a postPC world. In this paper, we investigate the efficient computation of the Optimal-Ate pairing over Barreto-Naehrig curves in softwar...
متن کاملHopf Pairings and (Co)induction Functors over Commutative Rings
Co)induction functors appear in several areas of Algebra in different forms. Interesting examples are the so called induction functors in the Theory of Affine Algebraic Groups. In this paper we investigate Hopf pairings (bialgebra pairings) and use them to study (co)induction functors for affine group schemes over arbitrary commutative ground rings. We present also a special type of Hopf pairin...
متن کاملHopf Pairings and Induction Functors over Rings
The so called induction functors appear in several areas of Algebra in different forms. Interesting examples are the induction functors in the Theory of Affine Algebraic groups. In this note we investigate the so called Hopf pairings (bialgebra pairings) and use them to study induction functors for affine group schemes over arbitrary commutative ground rings. We present also a special type of H...
متن کاملThe Realm of the Pairings
Bilinear maps, or pairings, initially proposed in a cryptologic context for cryptanalytic purposes, proved afterward to be an amazingly flexible and useful tool for the construction of cryptosystems with unique features. Yet, they are notoriously hard to implement efficiently, so that their effective deployment requires a careful choice of parameters and algorithms. In this paper we review the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IACR Cryptology ePrint Archive
دوره 2011 شماره
صفحات -
تاریخ انتشار 2011